A Tightly Secure DDH-based Multisignature with Public-Key Aggregation

نویسندگان

چکیده

From the birth of blockchain technology, multisignatures attract much attention as a tool for handling transactions. Concerning application to blockchain, with public-key aggregation, which can compress public keys signers single key, is preferable standard multisignature because and signature used in transaction are stored verify later. Several schemes key aggregation proposed, however, there no known having tight security reduction. We propose first whose proven be tightly secure under DDH assumption random oracle model. Our based on DDH-based by Le, Yang, Ghorbani, our proof different from theirs. The idea originates another Bonnecaze, Gabillon one. By tailoring their setting admits we prove multisignature.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tightly Secure Signatures and Public-Key Encryption

We construct the first public-key encryption scheme whose chosen-ciphertext (i.e., IND-CCA) security can be proved under a standard assumption and does not degrade in either the number of users or the number of ciphertexts. In particular, our scheme can be safely deployed in settings in which no a-priori bound on the number of encryptions and/or users is known. As a central technical building b...

متن کامل

Tightly Secure IBE Under Constant-Size Master Public Key

Chen and Wee [CRYPTO, 2013] proposed the first almost tightly and adaptively secure IBE in the standard model and left two open problems which called for a tightly secure IBE with (1) constant-size master public key and/or (2) constant security loss. In this paper, we propose an IBE scheme with constant-size master public key and tighter security reduction. This (partially) solves Chen and Wee’...

متن کامل

Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts

We provide a tight security proof for an IND-CCA RingLWE based Key Encapsulation Mechanism that is derived from a generic construction of Dent (IMA Cryptography and Coding, 2003). Such a tight reduction is not known for the generic construction. The resulting scheme has shorter ciphertexts than can be achieved with other generic constructions of Dent or by using the well-known Fujisaki-Okamoto ...

متن کامل

Tightly-Secure Authenticated Key Exchange

We construct the first Authenticated Key Exchange (AKE) protocol whose security does not degrade with an increasing number of users or sessions. We describe a three-message protocol and prove security in an enhanced version of the classical Bellare-Rogaway security model. Our construction is modular, and can be instantiated efficiently from standard assumptions (such as the SXDH or DLIN assumpt...

متن کامل

a cca2-secure incomparable public key encryption scheme

in 2003, waters, felten and sahai introduced a novel cryptographic primitive called incomparable public key cryptosystem to protect anonymity of message receivers in an untrusted network. in this setting, a receiver is allowed to create many anonymous identities for himself without divulging the fact that all these identities refer to the same receiver. recently, lee and lim improved the soluti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International journal of networking and computing

سال: 2021

ISSN: ['2185-2839', '2185-2847']

DOI: https://doi.org/10.15803/ijnc.11.2_319